On some small cardinals for Boolean algebras

نویسندگان

  • Ralph McKenzie
  • J. Donald Monk
چکیده

Assume that all algebras are atomless. (1) Spind(A x B) = Spind(A) U Spind(B). (2) Spind(H1-I~ Ai) = {co } U U,Ej Spind(Ai). Now suppose that K and 2 are infinite cardinals, with r uncountable and regular and with r. < 2. (3) There is an atomless Boolean algebra A such that u(A) = te and i(A) = A. (4) If 2 is also regular, then there is an atomless Boolean algebra A such that t(A) = s(A) = K and a(A) = 2. All results are in ZFC, and answer some problems posed in Monk [01] and Monk [oo]. Introduction. First we define the cardinal functions considered in this paper. In these definitions, assume that A is an atomless Boolean algebra. A subset X of A splits A provided that for every nonzero a E A there is a b E X such that a b 5 0 a -b. A partition of unity of A is a collection X of nonzero pairwise disjoint elements of A with supremum 1. A tower is a subset X of A\{ 1 } well-ordered by the Boolean ordering, with supremum 1. i(A) = min{ X : X is a maximal independent subset of A}; u(A) = min{ X : X generates an ultrafilter of A}; s(A) = min{ lX : X splits A}; a(A) = min{ X : X is an infinite partition of unity in A}; t(A) = min{ XI : X is a tower in A}; Spind(A) = {IX : X is a maximal independent subset of A}. The main results are then as indicated in the abstract. As a corollary of (1) we have i(A x B) = min{i(A), i(B)}. (1) answers questions raised in Monk [01] and Monk [oo]. With A = 9(ow)/fin, models M, N of ZFC in which u(A) < i(A) and s(A) < a(A) respectively hold have been known for a long time; see Blass, Shelah [87] and Balcar, Simon [89]. Thus a contribution here is a construction of such Boolean algebras in ZFC. The problems about obtaining such examples in ZFC were also raised in Monk [01]. In fact, the only inequality holding in all atomless Boolean algebras between the cardinal functions i, u, s, a, and t is t < s; these two results, together with examples in Monk [01], establish this. All of these cardinal functions for Boolean algebras generalize known ones for 9(w)/fin, and they are extensively discussed in Monk [01] and Monk [oo]. This article is self-contained, however. Received December 11, 2002; revised January 30, 2004. c 2004, Association for Symbolic Logic 0022-4812/04/6903-0004/$1.90

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Filter theory in MTL-algebras based on Uni-soft property

‎The notion of (Boolean) uni-soft filters‎ ‎in MTL-algebras is introduced‎, ‎and several properties of them are‎ ‎investigated‎. ‎Characterizations of (Boolean) uni-soft filters are discussed‎, ‎and some (necessary and sufficient) conditions‎ ‎for a uni-soft filter to be Boolean are provided‎. ‎The condensational property for a Boolean uni-soft filter is established.

متن کامل

On some classes of expansions of ideals in $MV$-algebras

In this paper, we introduce the notions of expansion of ideals in $MV$-algebras, $ (tau,sigma)- $primary, $ (tau,sigma)$-obstinate  and $ (tau,sigma)$-Boolean  in $ MV- $algebras. We investigate the relations of them. For example, we show that every $ (tau,sigma)$-obstinate ideal of an $ MV-$ algebra is $ (tau,sigma)$-primary  and $ (tau,sigma)$-Boolean. In particular, we define an expansion $ ...

متن کامل

Remarks on measurable Boolean algebras and sequential cardinals

The paper offers a generalization of Kalton–Roberts’ theorem on uniformly exhaustive Maharam’s submeasures to the case of arbitrary sequentially continuous functionals. Applying the result one can reduce the problem of measurability of sequential cardinals to the question whether sequentially continuous functionals are uniformly exhaustive.

متن کامل

σ-Entangled Linear Orders and Narrowness of Products of Boolean Algebras

We investigate σ-entangled linear orders and narrowness of Boolean algebras. We show existence of σ-entangled linear orders in many cardinals, and we build Boolean algebras with neither large chains nor large pies. We study the behavior of these notions in ultraproducts. ∗ Partially supported by the Deutsche Forschungsgemeinschaft, Grant No. Ko 490/7-1. Publication 462.

متن کامل

Games and General Distributive Laws in Boolean Algebras

The games G 1 (κ) and G η <λ(κ) are played by two players in η +complete and max(η+ , λ)-complete Boolean algebras, respectively. For cardinals η, κ such that κ<η = η or κ<η = κ, the (η, κ)-distributive law holds in a Boolean algebra B iff Player 1 does not have a winning strategy in G 1 (κ). Furthermore, for all cardinals κ, the (η,∞)-distributive law holds in B iff Player 1 does not have a wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Log.

دوره 69  شماره 

صفحات  -

تاریخ انتشار 2004